Adaptively secure distributed public-key systems
نویسندگان
چکیده
منابع مشابه
Adaptively-Secure Distributed Public-Key Systems
When attacking a distributed protocol, an adaptive adversary is able to determine its actions (e.g., which parties to corrupt) at any time based on its entire view of the protocol including the entire communication history. Proving security of cryptographic protocols against adaptive adversaries is a fundamental problem in cryptography. In this paper, we consider distributed public-key systems ...
متن کاملAdaptively-Secure, Non-interactive Public-Key Encryption
Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret data of alreadycorrupted parties. Ideally, an adaptively-secure encryption scheme should, like standard public-key encryption, allow arbitrarily-many parties to use a single encryption key to securely encrypt arbitra...
متن کاملEfficient Public Key Steganography Secure Against Adaptively Chosen Stegotext Attacks
We define the notion of adative chosen stegotext security. We then construct efficient public key steganographic schemes secure against adaptively chosen stegotext attacks, without resort to any special existence assumption such as unbiased functions. This is the first time such a construction is obtained. Not only our constructions are secure, but also are essentially optimal and have no error...
متن کاملAdaptively-Secure Authenticated Key Exchange Protocol in Standard Model
Design a Secure Authenticated Key Exchange (AKE) protocol is a wide research area. Many works have been done in this field and remain few open problems. Design an AKE-secure without NAXOS approach is remaining as an open problem. NAXOS approach [18] is used to hide the ephemeral secret key from an adversary even if the adversary in somehow may obtain the ephemeral secret key. Using NAXOS approa...
متن کاملa cca2-secure incomparable public key encryption scheme
in 2003, waters, felten and sahai introduced a novel cryptographic primitive called incomparable public key cryptosystem to protect anonymity of message receivers in an untrusted network. in this setting, a receiver is allowed to create many anonymous identities for himself without divulging the fact that all these identities refer to the same receiver. recently, lee and lim improved the soluti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00260-2